Using Hoare Logic in a Process Algebra Setting
نویسندگان
چکیده
This paper concerns the relation between process algebra and Hoare logic. We investigate question whether how a logic can be used for reasoning about data change in course of when equationally that process. introduce an extension ACP (Algebra Communicating Processes) with features are relevant to processes which involved, present considered this algebra, discuss use as complement pure equational axioms algebra.
منابع مشابه
On Hoare Logic, Kleene Algebra, and Types
We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augmented with subtypes and typecasting. Assertions are interpreted as typecast operators. Thus Hoare-style reasoning with partial correctness assertions reduces to typechecking in this system.
متن کاملA Developer-oriented Hoare Logic
Even with current automated reasoning technology, full functional verification requires human interaction to guide the proof: assignments to ghost variables (e.g. [1]) or intermediate assertions (e.g. [17]) need to be provided, and sometimes the prover’s deductions need to be examined in detail (e.g. [1, §7],[13]). Indeed, some authors have argued that the developer’s understanding will be nece...
متن کاملProcess Algebra and Hoare's Logic
A Hoare-like logic is introduced for deriving`partial correctness assertions' of the form fg p fg, where ; are unary predicates over some state space S and p is an expression over a recursive, non-uniform language containing global nondeterminism (+) and sequential composition (). This logic is (relatively) complete if only guarded recursion is considered.
متن کاملProcess Algebra and Dynamic Logic
An extension of process algebra is introduced which can be compared to (propositional) dynamic logic. The additional feature is a ‘guard’ construct, related to the notion of a test in dynamic logic. This extension of process algebra is semantically based on processes that transform data, and its operational semantics is defined relative to a structure describing these transformations via transi...
متن کاملQuantum Relational Hoare Logic
We present a logic for reasoning about pairs of interactive quantum programs – quantum relational Hoare logic (qRHL). This logic follows the spirit of probabilistic relational Hoare logic (Barthe et al. 2009) and allows us to formulate how the outputs of two quantum programs relate given the relationship of their inputs. Probabilistic RHL was used extensively for computer-verified security proo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2021
ISSN: ['1875-8681', '0169-2968']
DOI: https://doi.org/10.3233/fi-2021-2026